B . Bérard and L . Sierra Comparing verification with HyTech , Kronos and Uppaal on the railroad crossing example
نویسنده
چکیده
Timed nite automata, introduced by Alur and Dill, are one of the most widely studied models for real-time systems. We focus in this paper on the practical issue of veriication for such systems. More precisely , we investigate the comparative performances of three well known veriication tools : HyTech, Kronos and Uppaal.
منابع مشابه
CMC: A Tool for Compositional Model-Checking of Real-Time Systems
In this paper we present a tool ((Me) for compositional modelchecking of real-time systems. (M( is based on a completely different method compared to existing real-time verification tools (HYTECH, KRONOS, UPPAAL). After a description of the method, we illustrate its efficiency by considering two examples : the Fischer's mutual exclusion protocol and a railroad crossing system.
متن کاملEfficient Reachability Analysis and Refinement Checking of Timed Automata Using BDDs
For the formal specification and verification of real-time systems we use the modular formalism Cottbus Timed Automata (CTA), which is an extension of timed automata [AD94]. Matrix-based algorithms for the reachability analysis of timed automata are implemented in tools like Kronos, Uppaal, HyTech and Rabbit. A new BDD-based version of Rabbit, which supports also refinement checking, is now ava...
متن کاملCompositional Termination Analysis of Symbolic Forward Analysis
Existing model checking tools for infinite state systems, such as UPPAAL, HYTECH and KRONOS, use symbolic forward analysis, a possibly nonterminating procedure. We give termination criteria that allow us to reason compositionally about systems defined with asynchronous parallel composition; we can prove the termination of symbolic forward analysis for a composed system from the syntactic condit...
متن کاملAn Introduction to Hybrid Automata
ion methods are used to simplify models and make their analysis more tractable. Several equivalence relations have been studied for subclasses of hybrid systems. For example, it can be shown that transition systems of timed automata admit finite state abstractions, called region graphs, that are time-abstract bisimilar, see [AD94] for details. Those equivalence results are used to prove decidab...
متن کاملAutomatic Analysis of Embedded Systems Specified in Astral
A prerequisite for successful software development is the availability of a complete and consistent software requirements specification. One way to asses the correctness of requirements specifications is the application of formal verification. Recently, the verification tool Uppaal [12, 16] has become available. Uppaal performs automatic verification of properties of real-time systems through m...
متن کامل